package com.example.algorithm.dp;

/**
 * ProjectName personal-algorithm
 * 不同路径
 * @author xieyucan
 * <br>CreateDate 2022/9/7 12:14
 */
public class DifferentPath {

    public int uniquePaths(int m, int n) {
        int [][]dp=new int[m][n];
        for(int i=0;i<n;i++)
        {
            dp[0][i]=1;
        }
        for(int i=0;i<m;i++)
        {
            dp[i][0]=1;
        }
        dp[0][0]=0;
        for(int i=1;i<m;i++)
        {
            for(int j=1;j<n;j++)
            {
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }

    public static void main(String[] args) {
        DifferentPath differentPath = new DifferentPath();
        System.out.println(differentPath.uniquePaths(3, 7));

    }
}
